countably saturated model

См. также в других словарях:

• Saturated model — There is an unrelated notion of saturated model in the context of structural equation modeling. In mathematical logic, and particularly in its subfield model theory, a saturated model M is one which realizes as many complete types as may be… …   Wikipedia

• Vaught conjecture — The Vaught conjecture is a conjecture in the mathematical field of model theory originally proposed by Robert Lawson Vaught in 1961. It concerns the possible numbers of countable models of a first order complete theory. While some special cases… …   Wikipedia

• Rado graph — The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… …   Wikipedia

• Hyperreal number — *R redirects here. For R*, see Rockstar Games. The system of hyperreal numbers represents a rigorous method of treating the infinite and infinitesimal quantities. The hyperreals, or nonstandard reals, *R, are an extension of the real numbers R… …   Wikipedia

• Morley rank — In mathematical logic, Morley rank, introduced by Michael D. Morley (1965), is a means of measuring the size of a subset of a model of a theory, generalizing the notion of dimension in algebraic geometry. Contents 1 Definition 2 Examples 3… …   Wikipedia

• Robert Lawson Vaught — (April 4 1926, Alhambra, California – April 2 2002) was a mathematical logician, and one of the founders of model theory. LifeVaught was a bit of a musical prodigy in his youth, in his case the piano. He began his university studies at Pomona… …   Wikipedia